A Multistart Variable Neighborhood Search for Uncapacitated Facility Location
نویسندگان
چکیده
An uncapacitated facility location problem considers a set of n warehouses W and a set of m stores S. Each warehouse w has a fixed cost fw, and the transportation cost from warehouse w to store s is given by cws. The problem is to find a subset of warehouses and an assignment of warehouses to stores in order to minimize the fixed and transportation costs. Observe that once the warehouses are selected, it suffices to assign the stores to their closest warehouse. Hence the problem consists of finding a subset Open of warehouses minimizing the function
منابع مشابه
Cuckoo search via Levy flights applied to uncapacitated facility location problem
Facility location problem (FLP) is a mathematical way to optimally locate facilities within a set of candidates to satisfy the requirements of a given set of clients. This study addressed the uncapacitated FLP as it assures that the capacity of every selected facility is finite. Thus, even if the demand is not known, which often is the case, in reality, organizations may still be able to take s...
متن کاملHeuristic Procedures for Solving the Discrete Ordered Median Problem
We present two heuristic methods for solving the Discrete Ordered Median Problem (DOMP), for which no such approaches have been developed so far. The DOMP generalizes classical discrete facility location problems, such as the p-median, p-center and Uncapacitated Facility Location problems. The first procedure proposed in this paper is based on a genetic algorithm developed by Moreno Vega [MV96]...
متن کاملThe Multistart Drop-Add-Swap Heuristic for the Uncapacitated Facility Location Problem
The uncapacitated facility location problem aims to select a subset of facilities to open, so that the demands of a given set of customers are satisfied at the minimum cost. In this study, we present a novel multistart Drop-Add-Swap heuristic for this problem. The proposed heuristic is multiple applications of the DropAdd-Swap heuristic with randomly generated initial solutions. And the propose...
متن کاملNeighborhood search heuristics for the uncapacitated facility location problem
The uncapacitated facility location problem is one of choosing sites among a set of candidates in which facilities can be located, so that the demands of a given set of clients are satisfied at minimum costs. Applications of neighborhood search methods to this problem have not been reported in the literature. In this paper we first describe and compare several neighborhood structures used by lo...
متن کاملA hybrid multistart heuristic for the uncapacitated facility location problem
We present a multistart heuristic for the uncapacitated facility location problem, based on a very successful method we originally developed for the p-median problem. We show extensive empirical evidence to the effectiveness of our algorithm in practice. For most benchmarks instances in the literature, we obtain solutions that are either optimal or a fraction of a percentage point away from it....
متن کامل